ℤ2ℤ4-additive perfect codes in Steganography

نویسندگان

  • Helena Rifà-Pous
  • Josep Rifà
  • Lorena Ronquillo
چکیده

Steganography is an information hiding application which aims to hide secret data imperceptibly into a cover object. In this paper, we describe a novel coding method based on Z2Z4-additive codes in which data is embedded by distorting each cover symbol by one unit at most (±1-steganography). This method is optimal and solves the problem encountered by the most efficient methods known today, concerning the treatment of boundary values. The performance of this new technique is compared with that of the mentioned methods and with the well-known rate-distortion upper bound to conclude that a higher payload can be obtained for a given distortion by using the proposed method.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Product perfect Z2 Z4-linear codes in steganography

Product perfect codes have been proven to enhance the performance of the F5 steganographic method, whereas perfect Z2Z4-linear codes have been recently introduced as an efficient way to embed data, conforming to the ±1-steganography. In this paper, we present two steganographic methods. On the one hand, a generalization of product perfect codes is made. On the other hand, this generalization is...

متن کامل

Perfect Z2Z4-linear codes applied to steganography

Steganography aims to hide secret data imperceptibly into a cover object. We describe a novel method based on Z2Z4-linear codes in which data is embedded by distorting each cover symbol by one unit at most (±1-steganography). This method solves the problem encountered by the most efficient methods known today, concerning the treatment of boundary values. Moreover, a generalization of the produc...

متن کامل

ℤ2ℤ4-Additive Cyclic Codes: Kernel and Rank

A Z2Z4-additive code C ⊆ Z α 2 ×Z 4 is called cyclic if the set of coordinates can be partitioned into two subsets, the set of Z2 and the set of Z4 coordinates, such that any cyclic shift of the coordinates of both subsets leaves the code invariant. Let Φ(C) be the binary Gray image of C. We study the rank and the dimension of the kernel of a Z2Z4-additive cyclic code C, that is, the dimensions...

متن کامل

Product Perfect Codes and Steganography 1

A new coding technique to be used in steganography is evaluated. The performance of this new technique is computed and comparisons with the well-known theoretical upper bound, Hamming upper bound and basic LSB are established.

متن کامل

Perfect Z2Z4-linear codes in Steganography

Steganography is an information hiding application which aims to hide secret data imperceptibly into a commonly used media. Unfortunately, the theoretical hiding asymptotical capacity of steganographic systems is not attained by algorithms developed so far. In this paper, we describe a novel coding method based on Z2Z4-linear codes that conforms to ±1-steganography, that is secret data is embed...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Adv. in Math. of Comm.

دوره 5  شماره 

صفحات  -

تاریخ انتشار 2011